Weapon Target Assignment with Combinatorial Optimization Techniques

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effect-Based Weapon-Target Assignment Optimization With Collateral Damage Under Control

In this work we optimize an effect-based weapon-target assignment that does not exceed a pre-determined upper bounds P1, P2, . . . , Pk for the collateral damage of k types of assets. That is, for given P1, P2, . . . , Pk we optimize weapon-target assignments with respect to kill overhead by minimizing overkill of targets and assuring that the kill probabilities of friendly asset types do not e...

متن کامل

A Neural Network — Based Optimization Algorithm for the Weapon-Target Assignment Problem

A neural network-based algorithm was developed for the Weapon-Target Assignment Problem (WTAP) in Ballistic Missile Defense (BMD). An optimal assignment policy is one which allocates targets to weapon platforms such that the total expected leakage value of targets surviving the defense is minimized. This involves the minimization of a non-linear objective function subject to inequality constrai...

متن کامل

Exact and Heuristic Methods for the Weapon Target Assignment Problem

The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...

متن کامل

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem

The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Advanced Research in Artificial Intelligence

سال: 2013

ISSN: 2165-4069

DOI: 10.14569/ijarai.2013.020707